LAW: A Workbench for Approximate Pattern Matching in Relational Data

نویسندگان

  • Michael Wolverton
  • Pauline M. Berry
  • Ian W. Harrison
  • John D. Lowrance
  • David N. Morley
  • Andres C. Rodriguez
  • Enrique H. Ruspini
  • Jérôme Thoméré
چکیده

Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what constitutes a match. We are developing the Link Analysis Workbench (LAW) to assist an expert user in the intelligence community in creating and maintaining patterns, matching those patterns against a large collection of relational data, and manipulating partial results. This paper describes two key facets of the LAW system: (1) a pattern-matching module based on a graph edit distance metric, and (2) a system architecture that supports the integration and tasking of multiple pattern matching modules based on their capabilities and the specific problem at hand.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supported Pattern Development in Intelligence Analysis ∗

Intelligence professionals work with incomplete and noisy data. Their information needs are often hard to express, and almost impossible to get right the first time. This paper describes the GEM pattern language for encoding analysts’ information needs in graphical patterns, and its use in the Link Analysis Workbench (LAW) system to find inexact matches to those patterns in large relational dat...

متن کامل

On Approximate Pattern Matching for a Class of Gibbs Random Fields

We prove an exponential approximation for the law of approximate occurrence of typical patterns for a class of Gibbsian sources on the lattice Z, d ≥ 2. From this result, we deduce a law of large numbers and a large deviation result for the the waiting time of distorted patterns. Key-words: Gibbs measures, approximate matching, exponential law, lossy data compression, law of large numbers, larg...

متن کامل

Adaptive Approximate Record Matching

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

متن کامل

Presentation of Information for Link Analysis

SRI’s LAW (Link Analysis Workbench) is a system that helps intelligence analysts detect occurrences of situations of interest by finding pattern instances in vast amounts of data using graph edit distance matching techniques. However to be completely successful it has to convey the results of the such findings to the users in a way that they can quickly grasp, not only to make use of it or to p...

متن کامل

On Approximate Pattern Matching for a Class of Gibbs Random Fields by Jean-rene Chazottes,

We prove an exponential approximation for the law of approximate occurrence of typical patterns for a class of Gibssian sources on the lattice Z d , d ≥ 2. From this result, we deduce a law of large numbers and a large deviation result for the waiting time of distorted patterns. 1. Introduction. In recent years there has been growing interest in a detailed probabilistic analysis of pattern matc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003